Approximations , Stable Operators , Well - Foundedfixpoints and Applications

In this paper we develop an algebraic framework for studying semantics of nonmonotonic logics. Our approach is formulated in the language of lattices, bilattices, operators and xpoints. The goal is to describe xpoints of an operator O deened on a lattice. The key intuition is that of an approximation, a pair (x; y) of lattice elements which can be viewed as an approximation to each lattice element z such that x z y. The key notion is that of an approximating operator, a monotone operator on the bilattice of approximations whose xpoints approximate the xpoints of the operator O. The main contribution of the paper is an algebraic construction which assigns a certain operator, called the stable operator, to every approximating operator on a bilattice of approximations. This construction leads to an abstract version of the well-founded semantics. In the paper we show that our theory ooers a uniied framework for semantic studies of logic programming, default logic and autoepistemic logic.